Knowledge-Based Hierarchical POMDPs for Task Planning
نویسندگان
چکیده
The main goal in task planning is to build a sequence of actions that takes an agent from initial state state. In robotics, this particularly difficult because usually have several possible results, and sensors are prone produce measurements with error. Partially observable Markov decision processes (POMDPs) commonly employed, thanks their capacity model the uncertainty modify monitor system. However, since solving POMDP computationally expensive, usage becomes prohibitive for most robotic applications. paper, we propose architecture service robotics. context robot design, present scheme encode knowledge about its environment, promotes modularity reuse information. Also, introduce new recursive definition enables our autonomously hierarchy POMDPs, so it can be used generate execute plans solve at hand. Experimental results show that, comparison baseline methods, by following hierarchical approach able significantly reduce time, while maintaining (or even improving) robustness under scenarios vary size.
منابع مشابه
Topological Orders Based Planning for Solving POMDPs
Although partially observable Markov decision processes (POMDPs) have received significant attention in past years, to date, solving problems of realistic order of magnitude remains a serious challenge. In this context, techniques that accelerate fundamental algorithms have been a main focus of research. Among them prioritized solvers suggest solutions to the problem of ordering backup operatio...
متن کاملPoint-Based Planning for Multi-Objective POMDPs
Many sequential decision-making problems require an agent to reason about both multiple objectives and uncertainty regarding the environment’s state. Such problems can be naturally modelled as multi-objective partially observable Markov decision processes (MOPOMDPs). We propose optimistic linear support with alpha reuse (OLSAR), which computes a bounded approximation of the optimal solution set...
متن کاملHierarchical Knowledge-Based Process Planning in Manufacturing
Artificial intelligence planning methods haven’t been used until rec ently to address the problem of computer-aided process planning (CAPP) in manufacturing in its entirety. They were simply not developed enough to tackle real-world problems of that complexity. In the paper we show that with so-called Hierarchical Task Networks, a recently matured general-purpose domainindependent planning meth...
متن کاملKnowledge-Based Policies for Qualitative Decentralized POMDPs
Qualitative Decentralized Partially Observable Markov Decision Problems (QDec-POMDPs) constitute a very general class of decision problems. They involve multiple agents, decentralized execution, sequential decision, partial observability, and uncertainty. Typically, joint policies, which prescribe to each agent an action to take depending on its full history of (local) actions and observations,...
متن کاملSemantics for Hierarchical Task Network Planning
One big obstacle to understanding the nature of hierarchical task net work htn planning has been the lack of a clear theoretical framework In particular no one has yet presented a clear and concise htn algorithm that is sound and complete In this paper we present a formal syntax and se mantics for htn planning Based on this syntax and semantics we are able to de ne an algorithm for htn planning...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Intelligent and Robotic Systems
سال: 2021
ISSN: ['1573-0409', '0921-0296']
DOI: https://doi.org/10.1007/s10846-021-01348-8